Convex Obstacles from Travelling Times
نویسندگان
چکیده
We consider situations where rays are reflected according to geometrical optics by a set of unknown obstacles. The aim is recover information about the obstacles from travelling-time data using methods and observations singularities. Suppose that, for disjoint union finitely many strictly convex smooth in Euclidean plane, no line meets more than two them. then give construction complete recovery travelling times rays.
منابع مشابه
Euclidean TSP between two nested convex obstacles
We present a polynomial-time algorithm for a variant of the Euclidean traveling salesman tour where n vertices are on the boundary of a convex polygon P and m vertices form the boundary of a convex polygonal obstacle Q completely contained within P . In the worst case the algorithm needs O(m lg m+ mn) time and O(nm + m) space.
متن کاملApproximate Euclidean shortest paths amid convex obstacles
We develop algorithms and data structures for the approximate Euclidean shortest path problem amid a set P of k convex obstacles in R and R, with a total of n faces. The running time of our algorithms is linear in n, and the size and query time of our data structure are independent of n. We follow a “core-set” based approach, i.e., we quickly compute a small sketch Q of P whose size is independ...
متن کاملPeriodic travelling waves in convex Klein-Gordon chains
We study Klein-Gordon chains with attractive nearest neighbour forces and convex on-site potential, and show that there exists a two-parameter family of periodic travelling waves (wave trains) with unimodal and even profile functions. Our existence proof is based on a saddle-point problem with constraints and exploits the invariance properties of an improvement operator. Finally, we discuss the...
متن کاملCoresets of obstacles in approximating Euclidean shortest path amid convex obstacles
Given a set P of non-intersecting polygonal obstacles in R defined with n vertices, we compute a sketch Ω of P whose size is independent of n. We utilize Ω to devise an algorithm to compute a (1 + )-approximate Euclidean shortest path between two points given with the description of P. When P comprises of convex polygonal obstacles, we devise a (2 + )approximation algorithm to efficiently answe...
متن کاملHeteroclinic Travelling Waves in Convex FPU-Type Chains
We consider infinite FPU-type atomic chains with general convex potentials and study the existence of monotone fronts that are heteroclinic travelling waves connecting constant asymptotic states. Iooss showed that small amplitude fronts bifurcate from convex-concave turning points of the force. In this paper we prove that fronts exist for any asymptotic states that satisfy a certain algebraic c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2021
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math9192434